Contributions to Seymour’s Second Neighborhood Conjecture
نویسندگان
چکیده
Let D be a simple digraph without loops or digons (i.e. if (u, v) ∈ E(D), then (v, u) 6∈ E(D)). For any v ∈ V (D) let N1(v) be the set of all vertices at out-distance 1 from v and let N2(v) be the set of all vertices at out-distance 2. We provide sufficient conditions under which there must exist some v ∈ V (D) such that |N1(v)| ≤ |N2(v)|, as well as examine properties of a minimal graph which does not have such a vertex. We show that if one such graph exists, then there exist infinitely many strongly-connected graphs having no such vertex.
منابع مشابه
The Second Neighborhood Conjecture For Oriented Graphs Missing Generalized Combs
Seymour’s Second Neighborhood Conjecture asserts that every oriented graph has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. We introduce the generalized comb, characterize them and prove that every oriented graph missing it satisfies this conjecture.
متن کاملAbout the second neighborhood problem in tournaments missing disjoint stars
Let D be a digraph without digons. Seymour’s second neighborhood conjecture states that D has a vertex v such that d(v) ≤ d(v). Under some conditions, we prove this conjecture for digraphs missing n disjoint stars. Weaker conditions are required when n = 2 or 3. In some cases we exhibit two such vertices.
متن کاملOn Seymour's Second Neighborhood conjecture of m-free digraphs
This paper gives an approximate result related to Seymour’s Second Neighborhood conjecture, that is, for anym-free digraph G, there exists a vertex v ∈ V (G) and a real number λm such that d(v) ≥ λmd+(v), and λm → 1 while m → +∞. This result generalizes and improves some known results in a sense. © 2017 Elsevier B.V. All rights reserved.
متن کاملA remark on the second neighborhood problem
Seymour’s second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Such a vertex is said to have the second neighborhood property (SNP). We define ”good” digraphs and prove a statement that implies that every feed vertex of a tournament has the SNP. In the case of digraphs missi...
متن کاملTowards a proof of Seymour’s Second Neighborhood Conjecture
Let D be a simple digraph without loops or digons. For any v ∈ V (D) let N1(v) be the set of all nodes at out-distance 1 from v and let N2(v) be the set of all nodes at out-distance 2. We provide conditions under which there must exist some v ∈ V (D) such that |N1(v)| ≤ |N2(v)|, as well as examine extremal properties in a minimal graph which does not have such a node. We show that if one such g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008